Ultraluminous Star-forming Galaxies and Extremely Luminous Warm Molecular Hydrogen Emission at z = 2.16 in the PKS 1138–26 Radio Galaxy Protocluster

A deep Spitzer Infrared Spectrograph map of the PKS 1138–26 galaxy protocluster reveals ultraluminous polycyclic aromatic hydrocarbon (PAH) emission from obscured star formation in three protocluster galaxies, including Hα-emitter (HAE) 229, HAE 131, and the central Spiderweb Galaxy. Star formation rates of ~500-1100 M_☉ yr^(–1) are estimated from the 7.7 μm PAH feature. At such prodigious formation rates, the galaxy stellar masses will double in 0.6-1.1 Gyr. We are viewing the peak epoch of star formation for these protocluster galaxies. However, it appears that extinction of Hα is much greater (up to a factor of 40) in the two ULIRG HAEs compared to the Spiderweb. This may be attributed to different spatial distributions of star formation-nuclear star formation in the HAEs versus extended star formation in accreting satellite galaxies in the Spiderweb. We find extremely luminous mid-IR rotational line emission from warm molecular hydrogen in the Spiderweb Galaxy, with L(H_2 0-0 S(3)) = 1.4 × 10^(44) erg s^(–1) (3.7 × 10^(10) L_☉), ~20 times more luminous than any previously known H2 emission galaxy (MOHEG). Depending on the temperature, this corresponds to a very large mass of >9 × 10^(6)-2 × 10^9 M_☉ of T > 300 K molecular gas, which may be heated by the PKS 1138–26 radio jet, acting to quench nuclear star formation. There is >8 times more warm H_2 at these temperatures in the Spiderweb than what has been seen in low-redshift (z < 0.2) radio galaxies, indicating that the Spiderweb may have a larger reservoir of molecular gas than more evolved radio galaxies. This is the highest redshift galaxy yet in which warm molecular hydrogen has been directly detected

An FPT 2-Approximation for Tree-Cut Decomposition

The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input $n$-vertex graph $G$ and an integer $w$, our algorithm either confirms that the tree-cut width of $G$ is more than $w$ or returns a tree-cut decomposition of $G$ certifying that its tree-cut width is at most $2w$, in time $2^{O(w^2\log w)} \cdot n^2$. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known.Comment: 17 pages, 3 figure

A possible endogonaceous fungus from the Triassic of Antarctica

No abstract is available for this item

A rare presentation of the Klinefelter's syndrome

A 16 years old boy with Chronic Renal Failure (CRF) was not suspected of having Klinefelter's syndrome until he complained of painful gynecomastia. He was under haemodialysis for 2 years. At first, he was in an approximately full pubertal development (P5, G5), but he had a small and a firm testis (length 2.2cm) and some degree of facial male pattern hair. He also had a decreased upper to lower body segment ratio and despite having chronic renal failure, he was taller than his parents and siblings. His laboratory tests showed high levels of FSH and normal levels of LH and testosterone. With regards to all these findings, we suspected that there might be an occult Klinefelter's syndrome. So, we made his karyotype that showed a 47XXY pattern. Because there are only a few number of cases that have occult Klinefelter's syndrome in the basis of chronic renal failure, we decided to report this case

The ATLAS 9.0 GHz Survey of the Extended Chandra Deep Field South: The Faint 9.0 GHz Radio Population

We present a new image of the 9.0 GHz radio emission from the extended Chandra Deep Field South. A total of 181 hours of integration with the Australia Telescope Compact Array has resulted in a 0.276 square degree image with a median sensitivity of $\sim$20 $\mu$Jy/beam rms, for a synthesised beam of 4.0 $\times$ 1.3 arcsec. We present a catalogue of the 9.0 GHz radio sources, identifying 70 source components and 55 individual radio galaxies. Source counts derived from this sample are consistent with those reported in the literature. The observed source counts are also generally consistent with the source counts from simulations of the faint radio population. Using the wealth of multiwavelength data available for this region, we classify the faint 9 GHz population and find that 91% are radio loud AGN, 7% are radio quiet AGN and 2% are star forming galaxies. The 9.0 GHz radio sources were matched to 5.5 and 1.4 GHz sources in the literature and we find a significant fraction of flat or inverted spectrum sources, with 36% of the 9 GHz sources having $\alpha_{5.5GHz}^{9.0GHz}$ $>$ -0.3 (for $S \propto \nu^\alpha$). This flat or inverted population is not well reproduced by current simulations of radio source populations.Comment: 17 pages, 12 figures. Accepted for publication in MNRA

On the Monadic Second-Order Transduction Hierarchy

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K). If we only consider classes of incidence structures we can completely describe the resulting hierarchy. It is linear of order type {\omega}+3. Each level can be characterised in terms of a suitable variant of tree-width. Canonical representatives of the various levels are: the class of all trees of height n, for each n \in N, of all paths, of all trees, and of all grids

Neural correlates of mentalizing-related computations during strategic interactions in humans

Competing successfully against an intelligent adversary requires the ability to mentalize an opponent's state of mind to anticipate his/her future behavior. Although much is known about what brain regions are activated during mentalizing, the question of how this function is implemented has received little attention to date. Here we formulated a computational model describing the capacity to mentalize in games. We scanned human subjects with functional MRI while they participated in a simple two-player strategy game and correlated our model against the functional MRI data. Different model components captured activity in distinct parts of the mentalizing network. While medial prefrontal cortex tracked an individual's expectations given the degree of model-predicted influence, posterior superior temporal sulcus was found to correspond to an influence update signal, capturing the difference between expected and actual influence exerted. These results suggest dissociable contributions of different parts of the mentalizing network to the computations underlying higher-order strategizing in humans

Dynamic Programming for Graphs on Surfaces

We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2^{O(k log k)} n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called "surface cut decomposition", generalizing sphere cut decompositions of planar graphs introduced by Seymour and Thomas, which has nice combinatorial properties. Namely, the number of partial solutions that can be arranged on a surface cut decomposition can be upper-bounded by the number of non-crossing partitions on surfaces with boundary. It follows that partial solutions can be represented by a single-exponential (in the branchwidth k) number of configurations. This proves that, when applied on surface cut decompositions, dynamic programming runs in 2^{O(k)} n steps. That way, we considerably extend the class of problems that can be solved in running times with a single-exponential dependence on branchwidth and unify/improve most previous results in this direction.Comment: 28 pages, 3 figure

Dynamic programming for graphs on surfaces

We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k·log k). Our approach combines tools from topological graph theory and analytic combinatorics.Postprint (updated version

The Herschel view of the environment of the radio galaxy 4C+41.17 at z = 3.8

We present Herschel observations at 70, 160, 250, 350 and 500 μm of the environment of the radio galaxy 4C+41.17 at z = 3.792. About 65 per cent of the extracted sources are securely identified with mid-infrared sources observed with the Spitzer Space Telescope at 3.6, 4.5, 5.8, 8 and 24 μm. We derive simple photometric redshifts, also including existing 850 and 1200 μm data, using templates of active galactic nuclei, starburst-dominated systems and evolved stellar populations. We find that most of the Herschel sources are foreground to the radio galaxy and therefore do not belong to a structure associated with 4C+41.17. We do, however, find that the spectral energy distribution (SED) of the closest (∼25 arcsec offset) source to the radio galaxy is fully consistent with being at the same redshift as 4C+41.17. We show that finding such a bright source that close to the radio galaxy at the same redshift is a very unlikely event, making the environment of 4C+41.17 a special case. We demonstrate that multiwavelength data, in particular on the Rayleigh–Jeans side of the SED, allow us to confirm or rule out the presence of protocluster candidates that were previously selected by single wavelength data setsPeer reviewe